Addressing cross-allocated blocks in a file system

ABSTRACT

A mechanism is provided for cross-allocated block repair in a mounted file system. A set of cross-allocated blocks are identified from a plurality of blocks within an inode of the mounted file system, based on a corresponding bit associated with each cross-allocated block in a duplicated block information bitmap being in a first identified state. The set of cross-allocated blocks are repaired using a user-defined repair process. Then one or more of the set of cross-allocated blocks are deallocated based on results of the user-defined repair process.

BACKGROUND

The present application relates generally to an improved data processingapparatus and method and more specifically to mechanisms for addressingcross-allocated blocks in a file system.

A file system is a means to organize data expected to be retained aftera program terminates by storing, retrieving, and updating data, as wellas managing available space on device(s) which comprises the filesystem. A file system organizes data in an efficient manner and is tunedto characteristics specific to the device or disk which comprises thefile system. Some file systems provide mechanisms to control access tothe data and metadata. Ensuring reliability is a major responsibility ofa file system.

Some current disks support many different file systems providingflexibility so that many operating systems may be supported, filesystems such as: ext, ext2, xia, minix, umsdos, msdos, vat, proc, smb,ncp, iso9660, sysv, hpfs, affs, and ufs, and no doubt, over time morewill be added. Each of the separate file systems may be combined into asingle hierarchical tree structure that represents the file system asone whole single entity. That is, as each new files system is mounted ona disk, the disk adds the new file system into this single file systemtree.

When a disk is initialized, the disk has a partition structure imposedthat divides the physical disk into a number of logical partitions. Eachpartition may hold a single file system. File systems organize filesinto logical hierarchical structures with directories, soft links, andso on, held in blocks on physical devices. Devices that can contain filesystems are known as block devices. These block devices are, thus,simply linear collections of blocks that exist without regard to theunderlying physical disk's geometry. It is the task of a block devicedriver associated with each block to map a request to read a particularblock of its disk into terms meaningful to its disk; the particulartrack, sector, and cylinder of its hard disk where the block is kept.

Thus, the files in a file system are collections of data. A file systemnot only holds the data that is contained within the files of the filesystem but also the structure of the file system. Thus, a layout of afile system may be illustrated as the file system occupying a series ofblocks in a block structured device. So far as each file system isconcerned, block devices are just a series of blocks that can be readand written. The file system divides the logical partition that itoccupies into block groups. Each block group duplicates informationcritical to the integrity of the file system as well as holding realfiles and directories as blocks of information and data.

In a file system, an inode is the basic building block. Every file anddirectory in the file system is described by one and only one inode. Ifa block is referred to across multiple inodes or multiple times withinthe same inode, these are called cross-allocated blocks or duplicateblocks. Such allocations are quite dangerous as these cross-allocatedblocks or duplicate blocks point to data corruption and at times havingan inode(s) referring a block that is already freed—caused by one of theother inodes that was cross referring the block being freed.

SUMMARY

In one illustrative embodiment, a method, in a data processing system,is provided for cross-allocated block repair in a mounted file system.The illustrative embodiment identifies a set of cross-allocated blocksfrom a plurality of blocks within an inode of the mounted file system,based on a corresponding bit associated with each cross-allocated blockin a duplicated block information bitmap being in a first identifiedstate. The illustrative embodiment repairs the set of cross-allocatedblocks using a user-defined repair process. The illustrative embodimentdeallocates one or more of the set of cross-allocated blocks based onresults of the user-defined repair process.

In other illustrative embodiments, a computer program product comprisinga computer useable or readable medium having a computer readable programis provided. The computer readable program, when executed on a computingdevice, causes the computing device to perform various ones of, andcombinations of, the operations outlined above with regard to the methodillustrative embodiment.

In yet another illustrative embodiment, a system/apparatus is provided.The system/apparatus may comprise one or more processors and a memorycoupled to the one or more processors. The memory may compriseinstructions which, when executed by the one or more processors, causethe one or more processors to perform various ones of, and combinationsof, the operations outlined above with regard to the method illustrativeembodiment.

These and other features and advantages of the present invention will bedescribed in, or will become apparent to those of ordinary skill in theart in view of, the following detailed description of the exampleembodiments of the present invention.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The invention, as well as a preferred mode of use and further objectivesand advantages thereof, will best be understood by reference to thefollowing detailed description of illustrative embodiments when read inconjunction with the accompanying drawings, wherein:

FIG. 1 depicts a pictorial representation of an example distributed dataprocessing system in which aspects of the illustrative embodiments maybe implemented;

FIG. 2 is a block diagram of an example data processing system in whichaspects of the illustrative embodiments may be implemented;

FIG. 3 depicts an exemplary physical layout of a file system inaccordance with an illustrative embodiment;

FIG. 4 depicts an example of an inode in accordance with an illustrativeembodiment;

FIG. 5 depicts a functional block diagram of a cross-allocated blockrepair mechanism for a mounted file system in accordance with anillustrative embodiment; and

FIG. 6 depicts a flow diagram of the operation performed by across-allocated block repair mechanism for a mounted file system inaccordance with an illustrative embodiment.

DETAILED DESCRIPTION

As discussed above, if a block is referred to across multiple inodes ormultiple times within the same inode, these are called cross-allocatedblocks or duplicate blocks. Such allocations are quite dangerous asthese cross-allocated blocks point to data corruption and at timeshaving an inode(s) referring a block that is already freed—caused by oneof the other inodes that was cross referring the block being freed.Current solutions to fix cross-allocated blocks require un-mounting thefile system, scanning the block allocation picture, identifyingcross-allocated blocks, and repairing the cross-allocated blocksaccordingly. However, these solutions require a file system outage.Further the larger the file system, the longer the scan takes, thus thelonger the file system outage window.

Therefore, the illustrative embodiments provide mechanisms foridentifying file system blocks that are cross allocated across inodesand repairing the cross-allocated block while on a mounted file system.The mechanisms identify the cross-allocated blocks by scanning a pointin time read only copy of the file system, i.e. temporary snapshotstaken just before the scan begins, and use this information as areference point to scan the mounted file system and repair the inodeswhich refer to the identified cross-allocated blocks. The mechanismsensure that the cross-allocated blocks are repaired without a need forfile system outage.

Accordingly, the illustrative embodiments may be utilized in manydifferent types of data processing environments. In order to provide acontext for the description of the specific elements and functionalityof the illustrative embodiments, FIGS. 1 and 2 are provided hereafter asexample environments in which aspects of the illustrative embodimentsmay be implemented. It should be appreciated that FIGS. 1 and 2 are onlyexamples and are not intended to assert or imply any limitation withregard to the environments in which aspects or embodiments of thepresent invention may be implemented. Many modifications to the depictedenvironments may be made without departing from the spirit and scope ofthe present invention.

FIG. 1 depicts a pictorial representation of an example distributed dataprocessing system in which aspects of the illustrative embodiments maybe implemented. Distributed data processing system 100 may include anetwork of computers in which aspects of the illustrative embodimentsmay be implemented. The distributed data processing system 100 containsat least one network 102, which is the medium used to providecommunication links between various devices and computers connectedtogether within distributed data processing system 100. The network 102may include connections, such as wire, wireless communication links, orfiber optic cables.

In the depicted example, server 104 and server 106 are connected tonetwork 102 along with storage unit 108. In addition, clients 110, 112,and 114 are also connected to network 102. These clients 110, 112, and114 may be, for example, personal computers, network computers, or thelike. In the depicted example, server 104 provides data, such as bootfiles, operating system images, and applications to the clients 110,112, and 114. Clients 110, 112, and 114 are clients to server 104 in thedepicted example. Distributed data processing system 100 may includeadditional servers, clients, and other devices not shown.

In the depicted example, distributed data processing system 100 is theInternet with network 102 representing a worldwide collection ofnetworks and gateways that use the Transmission ControlProtocol/Internet Protocol (TCP/IP) suite of protocols to communicatewith one another. At the heart of the Internet is a backbone ofhigh-speed data communication lines between major nodes or hostcomputers, consisting of thousands of commercial, governmental,educational and other computer systems that route data and messages. Ofcourse, the distributed data processing system 100 may also beimplemented to include a number of different types of networks, such asfor example, an intranet, a local area network (LAN), a wide areanetwork (WAN), or the like. As stated above, FIG. 1 is intended as anexample, not as an architectural limitation for different embodiments ofthe present invention, and therefore, the particular elements shown inFIG. 1 should not be considered limiting with regard to the environmentsin which the illustrative embodiments of the present invention may beimplemented.

FIG. 2 is a block diagram of an example data processing system in whichaspects of the illustrative embodiments may be implemented. Dataprocessing system 200 is an example of a computer, such as client 110 inFIG. 1, in which computer usable code or instructions implementing theprocesses for illustrative embodiments of the present invention may belocated.

In the depicted example, data processing system 200 employs a hubarchitecture including north bridge and memory controller hub (NB/MCH)202 and south bridge and input/output (I/O) controller hub (SB/ICH) 204.Processing unit 206, main memory 208, and graphics processor 210 areconnected to NB/MCH 202. Graphics processor 210 may be connected toNB/MCH 202 through an accelerated graphics port (AGP).

In the depicted example, local area network (LAN) adapter 212 connectsto SB/ICH 204. Audio adapter 216, keyboard and mouse adapter 220, modem222, read only memory (ROM) 224, hard disk drive (HDD) 226, CD-ROM drive230, universal serial bus (USB) ports and other communication ports 232,and PCI/PCIe devices 234 connect to SB/ICH 204 through bus 238 and bus240. PCI/PCIe devices may include, for example, Ethernet adapters,add-in cards, and PC cards for notebook computers. PCI uses a card buscontroller, while PCIe does not. ROM 224 may be, for example, a flashbasic input/output system (BIOS).

HDD 226 and CD-ROM drive 230 connect to SB/ICH 204 through bus 240. HDD226 and CD-ROM drive 230 may use, for example, an integrated driveelectronics (IDE) or serial advanced technology attachment (SATA)interface. Super I/O (SIO) device 236 may be connected to SB/ICH 204.

An operating system runs on processing unit 206. The operating systemcoordinates and provides control of various components within the dataprocessing system 200 in FIG. 2. As a client, the operating system maybe a commercially available operating system such as Microsoft® Windows7®. An object-oriented programming system, such as the Java™ programmingsystem, may run in conjunction with the operating system and providescalls to the operating system from Java™ programs or applicationsexecuting on data processing system 200.

As a server, data processing system 200 may be for example, an IBM®eServer™ System p® computer system, running the Advanced InteractiveExecutive (AIX®) operating system or the LINUX® operating system. Dataprocessing system 200 may be a symmetric multiprocessor (SMP) systemincluding a plurality of processors in processing unit 206.Alternatively, a single processor system may be employed.

Instructions for the operating system, the object-oriented programmingsystem, and applications or programs are located on storage devices,such as HDD 226, and may be loaded into main memory 208 for execution byprocessing unit 206. The processes for illustrative embodiments of thepresent invention may be performed by processing unit 206 using computerusable program code, which may be located in a memory such as, forexample, main memory 208, ROM 224, or in one or more peripheral devices226 and 230, for example.

A bus system, such as bus 238 or bus 240 as shown in FIG. 2, may becomprised of one or more buses. Of course, the bus system may beimplemented using any type of communication fabric or architecture thatprovides for a transfer of data between different components or devicesattached to the fabric or architecture. A communication unit, such asmodem 222 or network adapter 212 of FIG. 2, may include one or moredevices used to transmit and receive data. A memory may be, for example,main memory 208, ROM 224, or a cache such as found in NB/MCH 202 in FIG.2.

Those of ordinary skill in the art will appreciate that the hardware inFIGS. 1 and 2 may vary depending on the implementation. Other internalhardware or peripheral devices, such as flash memory, equivalentnon-volatile memory, or optical disk drives and the like, may be used inaddition to or in place of the hardware depicted in FIGS. 1 and 2. Also,the processes of the illustrative embodiments may be applied to amultiprocessor data processing system, other than the SMP systemmentioned previously, without departing from the spirit and scope of thepresent invention.

Moreover, the data processing system 200 may take the form of any of anumber of different data processing systems including client computingdevices, server computing devices, a tablet computer, laptop computer,telephone or other communication device, a personal digital assistant(PDA), or the like. In some illustrative examples, data processingsystem 200 may be a portable computing device that is configured withflash memory to provide non-volatile memory for storing operating systemfiles and/or user-generated data, for example. Essentially, dataprocessing system 200 may be any known or later developed dataprocessing system without architectural limitation.

Again a file system organizes data in an efficient manner and is tunedto characteristics specific to the device or disk which comprises thefile system, such as hard disk drive (HDD) 226 of FIG. 2. FIG. 3 depictsan exemplary physical layout of a file system in accordance with anillustrative embodiment. As shown in FIG. 3, file system 300 is built onthe premise that the data held in files is kept in blocks which are thengrouped into block groups, such as block groups 302 a, 302 b, . . . ,and 302 n. These block groups are normally the same length and, althoughthat length can vary between different file systems, the block size of aparticular file system is set when the file system is created. Not allof the blocks in each block group hold data, some must be used forinformation that describes the structure of the block group. Forexample, a block group may comprise: superblock 304 and groupdescriptors 306. Group descriptors 306 may further comprise block bitmap308, inode bitmap 310, inode table 312, or the like, in addition todatablocks 314.

Superblock 304 may comprise a description of the basic size and shape ofthis file system, which allows a file system manager to use and maintainthe file system. Usually only superblock 304 in block group 302 a isread when the file system is mounted but each block group contains aduplicate copy in case of file system corruption. Superblock 304 maycomprise a magic number, revision level, mount count and maximum mountcount, block group number, block size, block per group, free blocks,free inodes, first inode, or the like. The magic number allows mountingsoftware to check that superblock 304 is for the file system. Therevision level allows mounting code to determine whether or not thisfile system supports features that are only available in particularrevisions of the file system. There may also be feature compatibilityfields (not shown) which help the mounting code to determine which newfeatures can safely be used on this file system.

Together, the mount count and maximum mount count allow the dataprocessing system to determine whether the file system should be fullychecked. The mount count is incremented each time the file system ismounted and, when the mount count equals the maximum mount count, awarning message “maximal mount count reached, running file system checkis recommended” is displayed. The block group number identifies the copyof the superblock. The block size identifies the size of the block forthis file system in bytes, for example 1024 bytes. The blocks per groupidentify a number of blocks in a group, such as the block size as fixedwhen the file system is created. The free blocks identifier identifies anumber of free blocks in the file system. The free inodes identifieridentifies a number of free inodes in the file system and the firstinode identifier identifies an inode number of the first inode in thefile system, such as a directory entry for the ‘/’ directory.

Group descriptors 306 is a data structure describing the block group.Like superblock 304, all group descriptors for all of block groups areduplicated in each block group in case of file system corruption. Again,group descriptors 306 may further comprise block bitmap 308, inodebitmap 310, and inode table 312. Block bitmap 308 identifies the blocknumber of the block allocation bitmap for the block group, which is usedduring block allocation and deallocation. Inode bitmap 310 identifiesthe block number of the inode allocation bitmap for this block group,which is used during inode allocation and deallocation. Inode table 312identifies the block number of the starting block for the inode tablefor this block group.

In a file system, an inode is the basic building block. Every file anddirectory in the file system is described by one and only one inode.Inodes for each block group is kept in an inode table together with abitmap that allows the system to keep track of allocated and unallocatedinodes. FIG. 4 depicts an example of an inode in accordance with anillustrative embodiment. Amongst other information, inode 400 comprisesmode 402, owner information 404, size indicator 406, timestamps 408,direct datablocks 410, and indirect datablocks 412. Mode 402 holds twopieces of information: what inode 400 describes, such as file,directory, symbolic link, block device, character device, FIFO, or thelike, and the permissions that users have to inode 400. Ownerinformation 404 identifies user and group identifiers of the owners ofthis file or directory, which allows the file system to correctly allowthe correct accesses. Size indicator 406 identifies the size of the filein bytes. Timestamps 408 identifies the time that inode 400 was createdand the last time that inode 400 was modified. Direct datablocks 410 andindirect datablocks 412 identify pointers to the blocks that containdata 414 that inode 400 is describing. Direct datablocks 410 arepointers to the physical blocks containing data 414 described by inode400 and indirect datablocks 412 are pointers identifying more and morelevels of indirection. For example, double indirect datablocks 414pointer points at a block of pointers to blocks of pointers to data 414.

Thus, as data is stored on a disk or device, the data is stored in ablock through the previously described block allocation process. Again,the primary premise of the block allocation strategy for the data to bereferenced by only one allocated inode. However, during operation of thedata processing systems, any particular block of data is allocated anddeallocated and the inode that describes that data is allocated anddeallocated. Therefore, events may occur when more than one inode refersto a same allocated block due to issues within allocation and/ordeallocation. A block that is referred to by more than one inode isreferred to as a cross-allocated block or a duplicate block. Suchallocations are quite dangerous as one of the inodes point to datacorruption.

FIG. 5 depicts a functional block diagram of a cross-allocated blockrepair mechanism for a mounted file system in accordance with anillustrative embodiment. Cross-allocated block repair mechanism 500,which may be executed by a processor such as processing unit 206 of FIG.2, comprises bitmap logic 502, snapshot logic 504, comparison scanninglogic 506, and repair scanning logic 508. When cross-allocated blockrepair mechanism 500 is initiated, bitmap logic 502 generates allocationinformation bitmap 512 and duplicated block information bitmap 514 inmemory 510 for file system 518 on device 516. Each bit within allocationinformation bitmap 512 and duplicated block information bitmap 514represents a file system block in file system 518. Allocationinformation bitmap 512 represents the allocation state of file system518. Duplicated block information bitmap 514 represents blocks that arecross allocated across multiple inodes or multiple times within a sameinode. Bitmap logic 502 initially sets each bit in allocationinformation bitmap 512 and duplicated block information bitmap 514 to anOFF state.

With the bitmaps generated, snapshot logic 504 captures a point-in-timecopy or snapshot 520 of the file system state of file system 518.Comparison scanning logic 506 then scans the entire inode range fromsnapshot 520 from the starting inode to the maximum allocated inode. Toperform this scan, one by one, comparison scanning logic 506 locks aninode in snapshot 520 and the same inode in file system 518 to ensurethat there are no modifications to the inode or its block allocationwhile the scan is being performed. With both inodes locked, comparisonscanning logic 506 reads the inode's block allocation state fromsnapshot 520 and file system 518. Comparison scanning logic 506 thenidentities the file system blocks associated with the inode fromsnapshot 520 and file system 518. For each identified file system block,comparison scanning logic 506 records each identified block by settingits corresponding bit in allocation information bitmap 512 to an ONstate.

If comparison scanning logic 506 tries to turn on a bit that is alreadyset to ON in allocation information bitmap 512, then comparison scanninglogic 506 recognizes that the file system block was already discoveredas being associated with a previously scanned inode, thereby indicatingacross-allocated block. If such an event occurs, comparison scanninglogic 506 records the cross-allocated block by setting its correspondingbitmap in duplicated block information bitmap 514 to an ON state. Oncecomparison scanning logic 506 completes scanning the entire inode rangein snapshot 520, duplicated block information bitmap 514 comprises alist of all file system blocks that are cross located at the timesnapshot 520 of file system 518 was generated.

At this point, repair scanning logic 508 scans the entire inode range infile system 518 by locking each inode and walking the block allocationstate of each inode. Walking indicates stepping through the entire datapresented by each inode in file system 518 bit by bit. If repairscanning logic 508 encounters a file system block in the locked inode offile system 518 whose corresponding bit in duplicated block informationbitmap 514 is set to ON, repair scanning logic 508 repairs thecross-allocated block based on a user-defined repair. The user definedrepair may comprise, for example, marking all the cross-allocated filesystem blocks in each set of cross-allocated blocks as free, or markingall but one of the cross-allocated file system blocks in the set ofcross-allocated blocks as free. Repair scanning logic 508 alsodeallocates all cross-allocated blocks that are marked as free. Therepair process performed by repair scanning logic 508 is completed onceall of the inodes in file system 518 have been scanned and allcross-allocated blocks in the inode repaired. While the descriptionindicates starting with an OFF state and transitioning to an ON state,it will be appreciated by one of ordinary skill in the art that theillustrative embodiments may start with any state and transition toanother state as long as an indication of the transition is evident.

Thus, cross-allocated block repair mechanism 500 repairs or removescross-allocated blocks that are identified from snapshot 520. Anyallocations occurring after the generation of snapshot 520 may lead tonew cross allocations but will be corrected during subsequent executionsof cross-allocated block repair mechanism 500. Therefore, the executionof cross-allocated block repair mechanism 500 ensures that thecross-allocated blocks are repaired to the maximum possible extent withfile system 518 online and continuing to be used. In cases of severecorruptions, file system 518 may be un-mounted and cross-allocated blockrepair mechanism 500 may be executed offline.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method, or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in any one or more computer readablemedium(s) having computer usable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CDROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, in abaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Computer code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, radio frequency (RF), etc., or anysuitable combination thereof.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java™, Smalltalk™, C++, or the like, and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer, or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to the illustrativeembodiments of the invention. It will be understood that each block ofthe flowchart illustrations and/or block diagrams, and combinations ofblocks in the flowchart illustrations and/or block diagrams, can beimplemented by computer program instructions. These computer programinstructions may be provided to a processor of a general purposecomputer, special purpose computer, or other programmable dataprocessing apparatus to produce a machine, such that the instructions,which execute via the processor of the computer or other programmabledata processing apparatus, create means for implementing thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions thatimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus, or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

FIG. 6 depicts a flow diagram of the operation performed by across-allocated block repair mechanism for a mounted file system inaccordance with an illustrative embodiment. As the operation begins,bitmap logic within cross-allocated block repair mechanism generates anallocation information bitmap and a duplicated block information bitmapin memory for a file system on a device (step 602). Each bit within theallocation information bitmap and the duplicated block informationbitmap represents a file system block in the file system. The allocationinformation bitmap representing the allocation state of the file systemand the duplicated block information bitmap representing blocks that arecross allocated across multiple inodes or multiple times within a sameinode. The bitmap logic initially sets each bit in the allocationinformation bitmap and the duplicated block information bitmap to afirst state (step 604).

With the bitmaps generated, snapshot logic within the cross-allocatedblock repair mechanism captures a point-in-time copy or snapshot of thefile system state of the file system (step 606). Comparison scanninglogic within the cross-allocated block repair mechanism then scans theentire inode range from the snapshot from the starting inode to themaximum allocated inode (step 608). To perform this scan, one by one,the comparison scanning logic locks an inode in the snapshot and thesame inode in the file system (step 610) to ensure that there are nomodifications to the inode or its block allocation while the scan isbeing performed. With both inodes locked, the comparison scanning logicreads the inode's block allocation state from the snapshot and the filesystem (step 612). The comparison scanning logic then identifies thefile system blocks associated with the inode from the snapshot and thefile system (step 614).

For each identified file system block, the comparison scanning logicdetermines whether a corresponding bit in the allocation informationbitmap is already set to a second state (step 616). If the comparisonscanning logic determines that the corresponding bit in the allocationinformation bitmap is already set to the second state, then thecomparison scanning logic recognizes that the file system block wasalready discovered as being associated with a previously scanned inode,thereby indicating a cross-allocated block, and records thecross-allocated block by setting its corresponding bitmap in theduplicated block information bitmap to an second state (step 618). Ifthe comparison scanning logic determines that the corresponding bit inthe allocation information bitmap is not set to the second state, thenthe comparison scanning logic records each identified block by settingits corresponding bit in the allocation information bitmap to the secondstate (step 620).

From steps 618 and 620, the comparison scanning logic then determineswhether there is another inode in the snapshot to scan (step 622). If atstep 622 there is another inode in the snapshot to scan, then theoperation returns to step 610. If at step 622 there is not another inodein the snapshot to scan, then the repair scanning logic scans the entireinode in the file system by locking each inode and walking the blockallocation state of each inode (step 624). For each file system block inthe locked inode in the file system, the repair scanning logicdetermines whether the file system block's bit is set to the secondstate in the duplicated block information bitmap (step 626). If at step626, the repair scanning logic encounters a file system block in thefile system whose corresponding bit in the duplicated block informationbitmap is set to the second state, the repair scanning logic repairs thecross-allocated block based on a user-defined repair (step 628). Therepair scanning logic also deallocates all cross-allocated blocks thatare marked as free (step 630). From steps 626 or 630, the repairscanning logic determines whether there is another file system block inthe inode to scan (step 632). If at step 632 there is another filesystem block in the inode to scan, then the operation returns to step626. If at step 632 there is not another file system block in the inodeto scan, then the repair scanning logic determines if there is anotherinode in the file system to scan (step 634). If at step 634 there isanother inode to scan then the operation returns to step 624. If at step634 there is not another inode to scan then the operation terminates.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

Thus, the illustrative embodiments provide mechanisms for identifyingfile system blocks that are cross allocated across inodes and repairingthe cross-allocated block while on a mounted file system. The mechanismsidentify the cross-allocated blocks by scanning a point in time readonly copy of the file system, i.e. temporary snapshots taken just beforethe scan begins, and use this information as a reference point to scanthe mounted file system and repair the inodes which refer to theidentified cross-allocated blocks. The mechanisms ensure that thecross-allocated blocks are repaired without a need for file systemoutage.

As noted above, it should be appreciated that the illustrativeembodiments may take the form of an entirely hardware embodiment, anentirely software embodiment or an embodiment containing both hardwareand software elements. In one example embodiment, the mechanisms of theillustrative embodiments are implemented in software or program code,which includes but is not limited to firmware, resident software,microcode, etc.

A data processing system suitable for storing and/or executing programcode will include at least one processor coupled directly or indirectlyto memory elements through a system bus. The memory elements can includelocal memory employed during actual execution of the program code, bulkstorage, and cache memories which provide temporary storage of at leastsome program code in order to reduce the number of times code must beretrieved from bulk storage during execution.

Input/output or I/O devices (including but not limited to keyboards,displays, pointing devices, etc.) can be coupled to the system eitherdirectly or through intervening I/O controllers. Network adapters mayalso be coupled to the system to enable the data processing system tobecome coupled to other data processing systems or remote printers orstorage devices through intervening private or public networks. Modems,cable modems and Ethernet cards are just a few of the currentlyavailable types of network adapters.

The description of the present invention has been presented for purposesof illustration and description, and is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the art. Theembodiment was chosen and described in order to best explain theprinciples of the invention, the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

What is claimed is:
 1. A method, in a data processing system, forcross-allocated block repair in a mounted file system, the methodcomprising: identifying, by a processor in the data processing system, aset of cross-allocated blocks from a plurality of blocks within an inodeof the mounted file system, based on a corresponding bit associated witheach cross-allocated block in a duplicated block information bitmapbeing in a first identified state, wherein the duplicated blockinformation bitmap is populated by the method comprising: capturing, bythe processor, a snapshot of the mounted file system, wherein thesnapshot is a point-in-time copy of a file system state of the mountedfile system; scanning, by the processor, an entire inode range of thesnapshot; for each inode in the inode range, identifying, by theprocessor, file system blocks associated with the inode; responsive toidentifying each file system block associated with the inode,determining, by the processor, whether a corresponding bit in anallocation information bitmap is in a second identified state;responsive to the corresponding bit in the allocation information bitmapbeing in the second identified state, updating, by the processor, thecorresponding bit in the duplicated block information bitmap to thefirst identified state; and responsive to the corresponding bit in theallocation information bitmap failing to be in the second identifiedstate, updating, by the processor, the corresponding bit in theallocation information bitmap to the second identified state; repairing,by the processor, the set of cross-allocated blocks using a user-definedrepair process; and deallocating, by the processor, one or more of theset of cross-allocated blocks based on results of the user-definedrepair process.
 2. The method of claim 1, wherein the user definedrepair process is marking all of the set of cross-allocated blocks asfree.
 3. The method of claim 1, wherein the user defined repair processis marking all but one of the set of cross-allocated blocks as free. 4.The method of claim 1, wherein, prior to identifying the file systemblocks associated with the inode, the inode is locked to ensure that nomodifications are made to the inode or the inode's block allocationwhile the identification is being performed.
 5. A computer programproduct comprising a non-transitory computer readable storage mediumhaving a computer readable program stored therein, wherein the computerreadable program, when executed on a computing device, causes thecomputing device to: identify a set of cross-allocated blocks from aplurality of blocks within an inode of the mounted file system, based ona corresponding bit associated with each cross-allocated block in aduplicated block information bitmap being in a first identified state,wherein the computer readable program populates the duplicated blockinformation bitmap by causing the computing device to: capture asnapshot of the mounted file system, wherein the snapshot is apoint-in-time copy of a file system state of the mounted file system;scan an entire inode range of the snapshot; for each inode in the inoderange, identify file system blocks associated with the inode; responsiveto identifying each file system block associated with the inode,determine whether a corresponding bit in an allocation informationbitmap is in a second identified state; responsive to the correspondingbit in the allocation information bitmap being in the second identifiedstate, update the corresponding bit in the duplicated block informationbitmap to the first identified state; and responsive to thecorresponding bit in the allocation information bitmap failing to be inthe second identified state, update the corresponding bit in theallocation information bitmap to the second identified state; repair theset of cross-allocated blocks using a user-defined repair process; anddeallocate one or more of the set of cross-allocated blocks based onresults of the user-defined repair process.
 6. The computer programproduct of claim 5, wherein the user defined repair process is markingall of the set of cross-allocated blocks as free.
 7. The computerprogram product of claim 5, wherein the user defined repair process ismarking all but one of the set of cross-allocated blocks as free.
 8. Thecomputer program product of claim 5, wherein, prior to identifying thefile system blocks associated with the inode, the computer readableprogram causes the computing device to lock the inode to ensure that nomodifications are made to the inode or the inode's block allocationwhile the identification is being performed.
 9. An apparatus,comprising: a processor, and a memory coupled to the processor, whereinthe memory comprises instructions which, when executed by the processor,cause the processor to: identify a set of cross-allocated blocks from aplurality of blocks within an inode of the mounted file system, based ona corresponding bit associated with each cross-allocated block in aduplicated block information bitmap being in a first identified state,wherein the instructions populate the duplicated block informationbitmap by causing the processor to: capture a snapshot of the mountedfile system, wherein the snapshot is a point-in-time copy of a filesystem state of the mounted file system; scan an entire inode range ofthe snapshot; for each inode in the inode range, identify file systemblocks associated with the inode; responsive to identifying each filesystem block associated with the inode, determine whether acorresponding bit in an allocation information bitmap is in a secondidentified state; responsive to the corresponding bit in the allocationinformation bitmap being in the second identified state, update thecorresponding bit in the duplicated block information bitmap to thefirst identified state; and responsive to the corresponding bit in theallocation information bitmap failing to be in the second identifiedstate, update the corresponding bit in the allocation information bitmapto the second identified state; repair the set of cross-allocated blocksusing a user-defined repair process; and deallocate one or more of theset of cross-allocated blocks based on results of the user-definedrepair process.
 10. The apparatus of claim 9, wherein the user definedrepair process is marking all of the set of cross-allocated blocks asfree.
 11. The apparatus of claim 9, wherein the user defined repairprocess is marking all but one of the set of cross-allocated blocks asfree.
 12. The apparatus of claim 9, wherein, prior to identifying thefile system blocks associated with the inode, the instructions causesthe processor to lock the inode to ensure that no modifications are madeto the inode or the inode's block allocation while the identification isbeing performed.